Solving the train marshalling problem by inclusion–exclusion

The train marshalling problem

The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a partition S of f1; 2; :::; ng, is K (...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

A Multi-Heuristic Approach for Solving the Pre-Marshalling Problem

Minimizing the number of reshuffling operations at maritime container terminals incorporates the Pre-Marshalling Problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new meth...

Modeling and Solving the Train Timetabling Problem

Solving the Train Driver Recovery Problem

Changes in the train schedule affect the train driver duties. If a train is cancelled or delayed, the driver assigned to the train task might not be able to reach the station of his next train departure in time. In practice, if a driver is not available for the train departure, another driver, for instance, a reserve, is assigned to the task. If there are no drivers available to cover the task ...